Satisfiability of Ordering CSPs Above Average
نویسندگان
چکیده
We study the satisfiability of ordering constraint satisfaction problems (CSPs) above average. We show that for every k, the satisfiability above average of ordering CSPs of arity at most k is fixed-parameter tractable.
منابع مشابه
Hybrid Tractable Classes of Binary Quantified Constraint Satisfaction Problems
As a central problem in AI, the Constraint Satisfaction Problem (CSP), has been a popular paradigm to cope with complex combinational problems. A CSP consists of a set of variables and a set of constraints restricting the combinations of values taken by variables. The Quantified Constraint Satisfaction Problem (QCSP) is a generalization of the CSP, where variables are existentially or universal...
متن کاملEstimating Satisfiability
The problem of estimating the proportion of satisfiable instances of a given CSP (constraint satisfaction problem) can be tackled through weighting. It consists in putting onto each solution a non-negative real value based on its neighborhood in a way that the total weight is at least 1 for each satisfiable instance. We define in this paper a general weighting scheme for the estimation of satis...
متن کاملNew Bounds for Random Constraint Satisfaction Problems via Spatial Coupling
This paper is about a novel technique called spatial coupling and its application in the analysis of random constraint satisfaction problems (CSP). Spatial Coupling was recently invented in the area of error correcting codes where it has resulted in efficient capacity-achieving codes for a wide range of channels. However, this technique is not limited to problems in communications. It can be ap...
متن کاملA Trichotomy Theorem for the Approximate Counting of Complex-Weighted Bounded-Degree Boolean CSPs
We determine the computational complexity of approximately counting the total weight of variable assignments for every complex-weighted Boolean constraint satisfaction problem (or CSP) with any number of additional unary (i.e., arity 1) constraints, particularly, when degrees of input instances are bounded from above by a fixed constant. All degree-1 counting CSPs are obviously solvable in poly...
متن کاملUsing CSP To Improve Deterministic 3-SAT
We show how one can use certain deterministic algorithms for higher-value constraint satisfaction problems (CSPs) to speed up deterministic local search for 3SAT. This way, we improve the deterministic worst-case running time for 3-SAT to O(1.439n).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1503.03851 شماره
صفحات -
تاریخ انتشار 2015